Search results for "Betti number"
showing 10 items of 10 documents
Splittings of Toric Ideals
2019
Let $I \subseteq R = \mathbb{K}[x_1,\ldots,x_n]$ be a toric ideal, i.e., a binomial prime ideal. We investigate when the ideal $I$ can be "split" into the sum of two smaller toric ideals. For a general toric ideal $I$, we give a sufficient condition for this splitting in terms of the integer matrix that defines $I$. When $I = I_G$ is the toric ideal of a finite simple graph $G$, we give additional splittings of $I_G$ related to subgraphs of $G$. When there exists a splitting $I = I_1+I_2$ of the toric ideal, we show that in some cases we can describe the (multi-)graded Betti numbers of $I$ in terms of the (multi-)graded Betti numbers of $I_1$ and $I_2$.
L 2-topological invariants of 3-manifolds
1995
We give results on theL2-Betti numbers and Novikov-Shubin invariants of compact manifolds, especially 3-manifolds. We first study the Betti numbers and Novikov-Shubin invariants of a chain complex of Hilbert modules over a finite von Neumann algebra. We establish inequalities among the Novikov-Shubin invariants of the terms in a short exact sequence of chain complexes. Our algebraic results, along with some analytic results on geometric 3-manifolds, are used to compute theL2-Betti numbers of compact 3-manifolds which satisfy a weak form of the geometrization conjecture, and to compute or estimate their Novikov-Shubin invariants.
Linear quotients of Artinian Weak Lefschetz algebras
2013
Abstract We study the Hilbert function and the graded Betti numbers for “generic” linear quotients of Artinian standard graded algebras, especially in the case of Weak Lefschetz algebras. Moreover, we investigate a particular property of Weak Lefschetz algebras, the Betti Weak Lefschetz Property, which makes possible to completely determine the graded Betti numbers of a generic linear quotient of such algebras.
Real Line Arrangements and Surfaces with Many Real Nodes
2008
A long standing question is if the maximum number μ(d) of nodes on a surface of degree d in P( ) can be achieved by a surface defined over the reals which has only real singularities. The currently best known asymptotic lower bound, μ(d) 5 12 d, is provided by Chmutov’s construction from 1992 which gives surfaces whose nodes have non-real coordinates. Using explicit constructions of certain real line arrangements we show that Chmutov’s construction can be adapted to give only real singularities. All currently best known constructions which exceed Chmutov’s lower bound (i.e., for d = 3, 4, . . . , 8, 10, 12) can also be realized with only real singularities. Thus, our result shows that, up t…
Regularity and h-polynomials of toric ideals of graphs
2020
For all integers 4 ≤ r ≤ d 4 \leq r \leq d , we show that there exists a finite simple graph G = G r , d G= G_{r,d} with toric ideal I G ⊂ R I_G \subset R such that R / I G R/I_G has (Castelnuovo–Mumford) regularity r r and h h -polynomial of degree d d . To achieve this goal, we identify a family of graphs such that the graded Betti numbers of the associated toric ideal agree with its initial ideal, and, furthermore, that this initial ideal has linear quotients. As a corollary, we can recover a result of Hibi, Higashitani, Kimura, and O’Keefe that compares the depth and dimension of toric ideals of graphs.
Steiner systems and configurations of points
2020
AbstractThe aim of this paper is to make a connection between design theory and algebraic geometry/commutative algebra. In particular, given any Steiner SystemS(t, n, v) we associate two ideals, in a suitable polynomial ring, defining a Steiner configuration of points and its Complement. We focus on the latter, studying its homological invariants, such as Hilbert Function and Betti numbers. We also study symbolic and regular powers associated to the ideal defining a Complement of a Steiner configuration of points, finding its Waldschmidt constant, regularity, bounds on its resurgence and asymptotic resurgence. We also compute the parameters of linear codes associated to any Steiner configur…
On the variations of the Betti numbers of regular levels of Morse flows
2011
Abstract We generalize results in Cruz and de Rezende (1999) [7] by completely describing how the Betti numbers of the boundary of an orientable manifold vary after attaching a handle, when the homology coefficients are in Z, Q, R or Z p Z with p prime. First we apply this result to the Conley index theory of Lyapunov graphs. Next we consider the Ogasa invariant associated with handle decompositions of manifolds. We make use of the above results in order to obtain upper bounds for the Ogasa invariant of product manifolds.
ApproximatingL 2-invariants by their finite-dimensional analogues
1994
LetX be a finite connectedCW-complex. Suppose that its fundamental group π is residually finite, i.e. there is a nested sequence ... ⊂ Г m + 1 ⊂ Г m ⊂ ... ⊂ π of in π normal subgroups of finite index whose intersection is trivial. Then we show that thep-thL 2-Betti number ofX is the limit of the sequenceb p(Xm)/[π:Г m ] whereb p(Xm) is the (ordinary)p-th Betti number of the finite covering ofX associated with Г m .
On a Theorem of Greuel and Steenbrink
2017
A famous theorem of Greuel and Steenbrink states that the first Betti number of the Milnor fibre of a smoothing of a normal surface singularity vanishes. In this paper we prove a general theorem on the first Betti number of a smoothing that implies an analogous result for weakly normal singularities.
Data structures and algorithms for topological analysis
2014
International audience; One of the steps of geometric modeling is to know the topology and/or the geometry of the objects considered. This paper presents different data structures and algorithms used in this study. We are particularly interested by algebraic structures, eg homotopy and homology groups, the Betti numbers, the Euler characteristic, or the Morse-Smale complex. We have to be able to compute these data structures, and for (homotopy and homology) groups, we also want to compute their generators. We are also interested in algorithms CIA and HIA presented in the thesis of Nicolas DELANOUE, which respectively compute the connected components and the homotopy type of a set defined by…